On Some Conjectures of Griggs and Graffiti
نویسندگان
چکیده
We discuss a conjecture of J. R. Griggs relating the maximum number of leaves in a spanning tree of a simple, connected graph to the order and independence number of the graph. We prove a generalization of this conjecture made by the computer program Graffiti, and discuss other similar conjectures, including several generalizations of the theorem that the independence number of a simple, connected graph is not less than its radius.
منابع مشابه
A computational attack on the conjectures of Graffiti: New counterexamples and proofs
Graffiti is a computer program that checks for relationships among certain graph invariants. It uses a database of graphs and has generated well over 700 conjectures. Having obtained a readily available computer tape of all the nonisomorphic graphs with 10 or fewer vertices, we have tested approximately 200 of the Graffiti conjectures and have found counterexamples for over 40 of them. For each...
متن کاملSome conjectures of Graffiti.pc on total domination
We limit our discussion to graphs that are simple and finite of order . Although 8 we often identify a graph with its set of vertices, in cases where we need to be K explicit we write . A set of vertices of is said to Z ÐKÑ Q K dominate K provided each vertex of is either in or adjacent to a vertex of . K Q Q The domination number of is the minimum order of a dominating set. A K dominating prov...
متن کاملGraffiti.pc: A Variant of Graffiti
Graffiti.pc is a new conjecture-making program, whose design was influenced by the well-known conjecture making program, Graffiti. This paper addresses the motivation for developing the new program and a description, which includes a comparison to the program, Graffiti. The subsequent sections describe the form of conjectures and educational applications of Graffiti.pc to undergraduate research...
متن کاملSpanning Trees with Many Leaves and Average Distance
In this paper we prove several new lower bounds on the maximum number of leaves of a spanning tree of a graph related to its order, independence number, local independence number, and the maximum order of a bipartite subgraph. These new lower bounds were conjectured by the program Graffiti.pc, a variant of the program Graffiti. We use two of these results to give two partial resolutions of conj...
متن کاملSome new families of definite polynomials and the composition conjectures
The planar polynomial vector fields with a center at the origin can be written as an scalar differential equation, for example Abel equation. If the coefficients of an Abel equation satisfy the composition condition, then the Abel equation has a center at the origin. Also the composition condition is sufficient for vanishing the first order moments of the coefficients. The composition conjectur...
متن کامل